Cracking MD5 hashes by simultaneous usage of Multiple GPUs and CPUs over multiple machines in a network

نویسنده

  • Jega Anish Dev
چکیده

Cryptographic Hash functions find ubiquitous use in various applications like digital signatures, message authentication codes and other forms of security. Their associated vulnerabilities therefore make them a prevalent target for cyber criminals. General means of defeating hash based authentication involves both discovering and exploiting inherent weakness in cryptographic hash functions or by straight forward brute force attack on the hash Digest. The latter in most cases presents to be an extremely time intensive task. Recent times have however seen usage of GPUs for brute forcing hashes thus significantly accelerating the rate of brute forced hashes. This has further been extended to use simultaneous usage of multiple GPUs over multiple machines. Usage of CPUs for brute forcing have more or less lost importance over the advent of GPU based cracking. This paper presents an efficient method of maximally using computing resources by simultaneously using Graphics Processing Units (GPUs) and Central Processing Units (CPUs) of machines over a network and compares its efficiency against using networked GPUs alone. This also discusses the possibility of currently unseen exploitation of computing power of botnets. Keywords— MD5 Hash cracking, CUDA based cracking, combined usage of CPU and GPU for hash cracking, Botnet

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enabling Multiple Accelerator Acceleration for Java/OpenMP

While using a single GPU is fairly easy, using multiple CPUs and GPUs potentially distributed over multiple machines is hard because data needs to be kept consistent using message exchange and the load needs to be balanced. We propose (1) an array package that provides partitioned and replicated arrays and (2) a compute-device library to abstract from GPUs and CPUs and their location. Our syste...

متن کامل

Simultaneous Lot Sizing and Scheduling in a Flexible Flow Line

This paper breaks new ground by modelling lot sizing and scheduling in a flexible flow line (FFL) simultaneously instead of separately. This problem, called the ‘General Lot sizing and Scheduling Problem in a Flexible Flow Line’ (GLSP-FFL), optimizes the lot sizing and scheduling of multiple products at multiple stages, each stage having multiple machines in parallel. The objective is to satisf...

متن کامل

Parallelizing MD5 on Intel Architectures

Many publications use MD5 [6] as a benchmark to compare the speed of integer operations on various architectures. MD5 is by design suited to this purpose, because it consists of simple bitoperations on 32-bit registers with only few or no memory operation necessary. Intel CPUs serve as a basepoint for comparisons with massively parallel architectures such as GPUs and FPGAs. We will show that by...

متن کامل

On Password Guessing with GPUs and FPGAs

Passwords are still by far the most widely used form of user authentication, for applications ranging from online banking or corporate network access to storage encryption. Password guessing thus poses a serious threat for a multitude of applications. Modern password hashes are speci cally designed to slow down guessing attacks. However, having exact measures for the rate of password guessing a...

متن کامل

Scheduling of Multiple Autonomous Guided Vehicles for an Assembly Line Using Minimum Cost Network Flow

This paper proposed a parallel automated assembly line system to produce multiple products having multiple autonomous guided vehicles (AGVs). Several assembly lines are configured to produce multiple products in which the technologies of machines are shared among the assembly lines when required. The transportation between the stations in an assembly line (intra assembly line) and among station...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013